#include <bits/stdc++.h>
using namespace std;
int a[100005];
int q;
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;
    for(int i=0;i<=n-1;i++) cin >> a[i];
    sort(a,a+n);
    for(int i=0;i<=n-1;i++){
        int y=upper_bound(a,a+n,a[i])-a;
        if(y&&a[y]){
        a[y]=-1;
        q++;
        }
    }
    cout << n-q;
    return 0;
}
